Twists and Generalized Zolotarev Polynomials
نویسندگان
چکیده
In the previous article [3], the author investigated Diophantine equations of the form (∗) X − f(x)Y 2 = 1 and found that the set of the polynomial solutions of (∗) can be described in terms of the theory of twists and that of generalized Jacobian varieties. On the other hand, there are several articles ([1], [7]) which relate the solutions of (∗) with certain torsion points on the Jacobian variety of the hyperelliptic curve y2 = f(x). One of the purposes of the present paper is to show that our viewpoint reveals quite naturally the reason why the torsion points show up in this connection. Another purpose is to generalize the notion of the socalled Zolotarev polynomials and investigate the extremal property, which is studied in [11], and the arithmetic properties of the generalized ones. The original polynomials are investigated in [4] as the set of solutions of (∗) when deg f = 4, in connection with the universal family the elliptic curves y2 = f(x) with a specified torsion point, hence with the arithmetic of the modular curve X1(N). Furthermore, it is pointed out in [10] that, when the base field is the field of complex numbers, (∗) is related with certain planar graphs through the notion of “dessins d’enfants”. In the present paper, generalizing the method in [3], we will see the theory of twists provides us with natural and unified viewpoint to investigate these types of problems for polynomials f(x) of any degree. The plan of this paper is as follows. In Section 2 we recall the definition of twists and their fundamental properties. In Section 3, we will explain the reason why the polynomial solutions of (∗) are related with torsion divisors on the Jacobian variety of the hyperelliptic curve y2 = f(x), in terms of the theory of twists and that of the generalized Jacobian varieties. Section 4 is devoted to the investigation of extremal properties of the solutions. It
منابع مشابه
An Algebraic-Geometric Method for Computing Zolotarev Polynomials
Explicit expressions for Zolotarev polynomials of degree up to four have been known for long time (compare [15, 20]). One approach to compute Zolotarev polynomials is by quantifier elimination with cylindrical algebraic decomposition. In [5] this is used for computing Zolotarev polynomials up to degree 5. Challenged by Collins and Kaltofen [10] this was extended later up to degree 12 in [12]. A...
متن کاملAn Algebraic-Geometric Method for Computing Zolotarev Polynomials — Additional Information
This report is an appendix to [2] providing two pieces of information in addition to the explicit computations of [2]. On the one hand we treat the problem of explicit construction of proper Zolotarev polynomials of higher degree using explicit expressions for proper Zolotarev polynomials of lower degree. In particular we show how Z6, as computed in [2], is related to Z2. Furthermore, we provid...
متن کاملZolotarev polynomials and optimal FIR filters
The algebraic form of Zolotarev polynomials refraining from their parametric representation is introduced. A recursive algorithm providing the coefficients for a Zolotarev polynomial of an arbitrary order is obtained from a linear differential equation developed for this purpose. The corresponding narrow-band, notch and complementary pair FIR filters are optimal in Chebyshev sense. A recursion ...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملGeneralized numerical ranges of matrix polynomials
In this paper, we introduce the notions of C-numerical range and C-spectrum of matrix polynomials. Some algebraic and geometrical properties are investigated. We also study the relationship between the C-numerical range of a matrix polynomial and the joint C-numerical range of its coefficients.
متن کامل